Efficient Interpretation of Large Quantifications in a Process Algebra
نویسندگان
چکیده
The process algebra interpreter EBPAI supports the EB method, which was developed for the purpose of automating the development of information systems through code generation and efficient interpretation of abstract specifications. For general information system patterns, EBPAI executes in linear time with respect to the number of terms and operators in the process expression and in logarithmic time with respect to the number of entities in the system. This paper described three optimization techniques of EBPAI.
منابع مشابه
مدیریت بازآموزی همتامحور پرستاران شاغل در بخشهای مراقبت ویژه
Introduction: Retraining programs for nurses are usually run as workshops and group discussions causing challenges as limitations on the number of participants, long lasting duration and high costs. Since most of these programs are taught by instructors working outside of clinical setting , it is necessary to use a method to train large groups of nurses in a short time. The purpose of t his...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملTHE ANALOGUE OF WEIGHTED GROUP ALGEBRA FOR SEMITOPOLOGICAL SEMIGROUPS
In [1,2,3], A. C. Baker and J.W. Baker studied the subspace Ma(S) of the convolution measure algebra M, (S) of a locally compact semigroup. H. Dzinotyiweyi in [5,7] considers an analogous measure space on a large class of C-distinguished topological semigroups containing all completely regular topological semigroups. In this paper, we extend the definitions to study the weighted semigroup ...
متن کاملTHE DUALITY OF THE L?-REPRESENTATION ALGEBRA ?(S ) OF A FOUNDATION SEMIGROUP S AND FUNCTION ALGEBRAS
In the present paper for a large family of topological semigroups, namely foundation semigroups, for which topological groups and discrete semigroups are elementary examples, it is shown that ?(S) is the dual of a function algebra.
متن کاملCOMPUTATIONALLY EFFICIENT OPTIMUM DESIGN OF LARGE SCALE STEEL FRAMES
Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006